DOMINATION IN GRAPHS OF MINIMUM DEGREE FOUR
نویسندگان
چکیده
منابع مشابه
Stratification and domination in graphs with minimum degree two
A graph G is 2-stratified if its vertex set is partitioned into two classes (each of which is a stratum or a color class). We color the vertices in one color class red and the other color class blue. Let F be a 2-stratified graph with one fixed blue vertex v specified. We say that F is rooted at v. The Fdomination number of a graphG is the minimum number of red vertices ofG in a red-blue colori...
متن کاملOn Independent Domination Number of Graphs with given Minimum Degree
We prove a new upper bound on the independent domination number of graphs in terms of the number of vertices and the minimum degree. This bound is slightly better than that by J. Haviland 3] and settles Case = 2 of the corresponding conjecture by O. Favaron 2].
متن کاملDomination in Degree Splitting Graphs
Let G = (V, E) be a graph with V = S1 S2 ...,St T where each Si is a set of vertices having at least two vertices and having the same degree and T = V Si. The degree splitting graph of G is denoted by DS(G) is obtained from G by adding vertices w1, w2, ..., wt and joining wi to each vertex of Si (1 i t). Let the vertices and the edges of a graph G are called the elements of G. In this...
متن کاملtwo-out degree equitable domination in graphs
an equitable domination has interesting application in the contextof social networks. in a network, nodes with nearly equal capacitymay interact with each other in a better way. in the societypersons with nearly equal status, tend to be friendly. in thispaper, we introduce new variant of equitable domination of agraph. basic properties and some interesting results have beenobtained.
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korean Mathematical Society
سال: 2009
ISSN: 0304-9914
DOI: 10.4134/jkms.2009.46.4.759